Teoría de restricciones aplicada a la dirección administrativa y financiera de la escuela de medicina y ciencias de la salud de la universidad del rosario

La creación de la Escuela de Medicina y Ciencias de la Salud en la Universidad del Rosario el 1 de julio de 2009 generó la necesidad de apoyar un mayor número de profesores e investigadores en temas administrativos, financieros y jurídicos. Para ello fue necesaria la contratación de una coordinadora administrativa y una coordinadora financiera para que la gestión de la Dirección Administrativa y Financiera pudiera cumplir con el apoyo a la Academia. Sin embargo, la gestión jurídica que soporta los proyectos de Investigación, Asesoría y Consultoría de la Escuela de Medicina y Ciencias de la Salud no era lo suficientemente ágil frente a las necesidades de respuesta a los patrocinadores externos. Por lo tanto, por medio de la aplicación de la Teoría de Restricciones, construcción de nubes de conflictos, encuestas a los investigadores y desarrollo de un formulario como herramienta en el Sistema de Información SAP, se agilizó el proceso de la Oficina Jurídica no solo para los procesos de la Escuela de Medicina y Ciencias de la Salid sino para todas la facultades y dependencias de la Universidad del Rosario

Clouds of Suspicion: Airspace Arrangements, Escalation, and Discord in U.S./NATO-Russian Relations

How have cooperative airspace arrangements contributed to cooperation and discord in the Euro-Atlantic region? This study analyzes the role of three sets of airspace arrangements developed by Euro-Atlantic states since the end of the Cold War—(1) cooperative aerial surveillance of military activity, (2) exchange of air situational data, and (3) joint engagement of theater air and missile threats—in political-military relations among neighbors and within the region. These arrangements provide insights into the integration of Central and Eastern European states into Western security institutions, and the current discord that centers on the conflict in Ukraine and Russia’s place in regional security. The study highlights the role of airspace incidents as contributors to conflict escalation and identifies opportunities for transparency- and confidence-building measures to improve U.S./NATO-Russian relations. The study recommends strengthening the Open Skies Treaty in order to facilitate the resolution of conflicts and improve region-wide military transparency. It notes that political-military arrangements for engaging theater air and missile threats created by NATO and Russia over the last twenty years are currently postured in a way that divides the region and inhibits mutual security. In turn, the U.S.-led Regional Airspace Initiatives that facilitated the exchange of air situational data between NATO and then-NATO-aspirants such as Poland and the Baltic states, offer a useful precedent for improving air sovereignty and promoting information sharing to reduce the fear of war among participating states. Thus, projects like NATO’s Air Situational Data Exchange and the NATO-Russia Council Cooperative Airspace Initiative—if extended to the exchange of data about military aircraft—have the potential to buttress deterrence and contribute to conflict prevention. The study concludes that documenting the evolution of airspace arrangements since the end of the Cold War contributes to understanding of the conflicting narratives put forward by Russia, the West, and the states “in-between” with respect to reasons for the current state of regional security. The long-term project of developing a zone of stable peace in the Euro-Atlantic must begin with the difficult task of building inclusive security institutions to accommodate the concerns of all regional actors.

The Melbourne Decision-Making Questionnaire : an instrument for measuring patterns for coping with decisional conflict

A study was conducted to examine the factorial validity of the Flinders Decision Making Questionnaire (Mann, 1982), a 31-item self-report inventory designed to measure tendencies to use three major coping patterns identified in the conflict theory of decision making (Janis and Mann, 1977): vigilance, hypervigilance, and defensive avoidance (procrastination, buck-passing, and rationalization). A sample of 2051 university students, comprising samples from Australia (n=262), New Zealand (n=260), the USA (n=475), Japan (n=359), Hong Kong (n=281) and Taiwan (n=414) was administered the DMQ. Factorial validity of the instrument was tested by confirmatory factor analysis with LISREL. Five different substantive models, representing different structural relationships between the decision-coping patterns had unsatisfactory fit to the data and could not be validated. A shortened instrument, containing 22 items, yielded a revised model comprising four identifiable factors-vigilance, hypervigilance, buck-passing, and procrastination. The revised model had adequate fit with data for each country sample and for the total sample, and was confirmed. It is recommended that the 22-item instrument, named the Melbourne DMQ, replace the Flinders DMQ for measurement of decision-coping patterns.

QoS-Based Web Service Scheduling Accommodating Inter-Service Dependencies Using Minimal-Conflict Hill-Climbing Repair Genetic Algorithm

In the filed of semantic grid, QoS-based Web service scheduling for workflow optimization is an important problem.However, in semantic and service rich environment like semantic grid, the emergence of context constraints on Web services is very common making the scheduling consider not only quality properties of Web services, but also inter service dependencies which are formed due to the context constraints imposed on Web services. In this paper, we present a repair genetic algorithm, namely minimal-conflict hill-climbing repair genetic algorithm, to address scheduling optimization problems in workflow applications in the presence of domain constraints and inter service dependencies. Experimental results demonstrate the scalability and effectiveness of the genetic algorithm.

QoS-based web service composition accommodating inter-service dependencies using minimal-conflict , hill-climbing repair genetic algorithm

In the field of semantic grid, QoS-based Web service composition is an important problem. In semantic and service rich environment like semantic grid, the emergence of context constraints on Web services is very common making the composition consider not only QoS properties of Web services, but also inter service dependencies and conflicts which are formed due to the context constraints imposed on Web services. In this paper, we present a repair genetic algorithm, namely minimal-conflict hill-climbing repair genetic algorithm, to address the Web service composition optimization problem in the presence of domain constraints and inter service dependencies and conflicts. Experimental results demonstrate the scalability and effectiveness of the genetic algorithm.

Safety climate and relational conflict in the eyes of team members : examining the role of need for closure

This study was aimed at examining the safety climate and relational conflict within teams at the individual level. A sample of 372 respondents, divided into 50 teams, was used to test our hypothesis. It was proposed - and discovered - that team members’ individual differences in need for closure mitigated the negative relationship between perceptions of team safety climate and team relational conflict. The implications of our findings and the study’s limitations are discussed.

Motor conflict in Stroop tasks : direct evidence from single-trial electro-myography and electro-encephalography

Several brain imaging studies have assumed that response conflict is present in Stroop tasks. However, this has not been demonstrated directly. We examined the time-course of stimulus and response conflict resolution in a numerical Stroop task by combining single-trial electro-myography (EMG) and event-related brain potentials (ERP). EMG enabled the direct tracking of response conflict and the peak latency of the P300 ERP wave was used to index stimulus conflict. In correctly responded trials of the incongruent condition EMG detected robust incorrect response hand activation which appeared consistently in single trials. In 50–80% of the trials correct and incorrect response hand activation coincided temporally, while in 20–50% of the trials incorrect hand activation preceded correct hand activation. EMG data provides robust direct evidence for response conflict. However, congruency effects also appeared in the peak latency of the P300 wave which suggests that stimulus conflict also played a role in the Stroop paradigm. Findings are explained by the continuous flow model of information processing: Partially processed task-irrelevant stimulus information can result in stimulus conflict and can prepare incorrect response activity. A robust congruency effect appeared in the amplitude of incongruent vs. congruent ERPs between 330–400 ms, this effect may be related to the activity of the anterior cingulate cortex.

Conflict resolution through negotiation in a railway open access market : a multi-agent system approach

Open access reforms to railway regulations allow multiple train operators to provide rail services on a common infrastructure. As railway operations are now independently managed by different stakeholders, conflicts in operations may arise, and there have been attempts to derive an effective access charge regime so that these conflicts may be resolved. One approach is by direct negotiation between the infrastructure manager and the train service providers. Despite the substantial literature on the topic, few consider the benefits of employing computer simulation as an evaluation tool for railway operational activities such as access pricing. This article proposes a multi-agent system (MAS) framework for the railway open market and demonstrates its feasibility by modelling the negotiation between an infrastructure provider and a train service operator. Empirical results show that the model is capable of resolving operational conflicts according to market demand.

Railway junction conflict resolution by genetic algorithm

In general, simple and traditional methods are applied to resolve traffic conflicts at railway junctions. They are, however, either inefficient or computationally demanding. A simple genetic algorithm is presented to enable a search for a near optimal resolution to be carried out while meeting the constraints on generation evolution and minimising the search time.

The conflict resolution in connected railway junctions

Purpose of study: Traffic conflicts occur when trains on different routes approach a converging junction in a railway network at the same time. To prevent collisions, a right-of-way assignment is needed to control the order in which the trains should pass the junction. Such control action inevitably requires the braking and/or stopping of trains, which lengthens their travelling times and leads to delays. Train delays cause a loss of punctuality and hence directly affect the quality of service. It is therefore important to minimise the delays by devising a suitable right-of-way assignment. One of the major difficulties in attaining the optimal right-of-way assignment is that the number of feasible assignments increases dramatically with the number of trains. Connected-junctions further complicate the problem. Exhaustive search for the optimal solution is time-consuming and infeasible for area control (multi-junction). Even with the more intelligent deterministic optimisation method revealed in [1], the computation demand is still considerable, which hinders real-time control. In practice, as suggested in [2], the optimality may be traded off by shorter computation time, and heuristic searches provide alternatives for this optimisation problem.

Railway junction conflict resolution by local search method

This study investigates the application of local search methods on the railway junction traffic conflict-resolution problem, with the objective of attaining a quick and reasonable solution. A procedure based on local search relies on finding a better solution than the current one by a search in the neighbourhood of the current one. The structure of neighbourhood is therefore very important to an efficient local search procedure. In this paper, the formulation of the structure of the solution, which is the right-of-way sequence assignment, is first described. Two new neighbourhood definitions are then proposed and the performance of the corresponding local search procedures is evaluated by simulation. It has been shown that they provide similar results but they can be used to handle different traffic conditions and system requirements.

QoS-aware web service composition using genetic algorithms

Web service technology is increasingly being used to build various e-Applications, in domains such as e-Business and e-Science. Characteristic benefits of web service technology are its inter-operability, decoupling and just-in-time integration. Using web service technology, an e-Application can be implemented by web service composition — by composing existing individual web services in accordance with the business process of the application. This means the application is provided to customers in the form of a value-added composite web service. An important and challenging issue of web service composition, is how to meet Quality-of-Service (QoS) requirements. This includes customer focused elements such as response time, price, throughput and reliability as well as how to best provide QoS results for the composites. This in turn best fulfils customers’ expectations and achieves their satisfaction. Fulfilling these QoS requirements or addressing the QoS-aware web service composition problem is the focus of this project. From a computational point of view, QoS-aware web service composition can be transformed into diverse optimisation problems. These problems are characterised as complex, large-scale, highly constrained and multi-objective problems. We therefore use genetic algorithms (GAs) to address QoS-based service composition problems. More precisely, this study addresses three important subproblems of QoS-aware web service composition; QoS-based web service selection for a composite web service accommodating constraints on inter-service dependence and conflict, QoS-based resource allocation and scheduling for multiple composite services on hybrid clouds, and performance-driven composite service partitioning for decentralised execution. Based on operations research theory, we model the three problems as a constrained optimisation problem, a resource allocation and scheduling problem, and a graph partitioning problem, respectively. Then, we present novel GAs to address these problems. We also conduct experiments to evaluate the performance of the new GAs. Finally, verification experiments are performed to show the correctness of the GAs. The major outcomes from the first problem are three novel GAs: a penaltybased GA, a min-conflict hill-climbing repairing GA, and a hybrid GA. These GAs adopt different constraint handling strategies to handle constraints on interservice dependence and conflict. This is an important factor that has been largely ignored by existing algorithms that might lead to the generation of infeasible composite services. Experimental results demonstrate the effectiveness of our GAs for handling the QoS-based web service selection problem with constraints on inter-service dependence and conflict, as well as their better scalability than the existing integer programming-based method for large scale web service selection problems. The major outcomes from the second problem has resulted in two GAs; a random-key GA and a cooperative coevolutionary GA (CCGA). Experiments demonstrate the good scalability of the two algorithms. In particular, the CCGA scales well as the number of composite services involved in a problem increases, while no other algorithms demonstrate this ability. The findings from the third problem result in a novel GA for composite service partitioning for decentralised execution. Compared with existing heuristic algorithms, the new GA is more suitable for a large-scale composite web service program partitioning problems. In addition, the GA outperforms existing heuristic algorithms, generating a better deployment topology for a composite web service for decentralised execution. These effective and scalable GAs can be integrated into QoS-based management tools to facilitate the delivery of feasible, reliable and high quality composite web services.